Bounding the quantum capacity with flagged extensions
نویسندگان
چکیده
In this article we consider flagged extensions of convex combination quantum channels, and find general sufficient conditions for the degradability extension. An immediate application is a bound on $Q$ private $P$ capacities any channel being mixture unitary map another channel, with probability associated to component larger than $1/2$. We then specialize our Pauli obtaining family upper bounds channels. particular, establish new state-of-the-art depolarizing BB84 generalized amplitude damping channel. Moreover, construction can be naturally applied tensor powers channels less restricting conditions, suggesting that better could found by considering number uses.
منابع مشابه
The Flagged Cauchy Determinant
We consider a flagged form of the Cauchy determinant, for which we provide a combinatorial interpretation in terms of nonintersecting lattice paths. In combination with the standard determinant for the enumeration of nonintersecting lattice paths, we are able to give a new proof of the Cauchy identity for Schur functions. Moreover, by choosing different starting and end points for the lattice p...
متن کاملBounding the set of quantum correlations.
We introduce a hierarchy of conditions necessarily satisfied by any distribution P_{alphabeta} representing the probabilities for two separate observers to obtain outcomes alpha and beta when making local measurements on a shared quantum state. Each condition in this hierarchy is formulated as a semidefinite program. Among other applications, our approach can be used to obtain upper bounds on t...
متن کاملTowards Quantum Distance Bounding Protocols
Distance Bounding (DB) is a security technique through which it is possible to determine an upper-bound on the physical distance between two parties (denoted as verifier and prover). These protocols typically combine physical properties of the communication channel with cryptographic challenge-response schemes. A key challenge to design secure DB protocols is to keep the time required by the pr...
متن کاملConstant addition with flagged binary adder architectures
The goal of this paper is to present architectures that provide the flexibility within a regular adder to augment/decrement the sum of two numbers by a constant. This flexibility adds to the functionality of a regular adder, achieving a comparable performance to conventional designs, thereby eliminating the need of having a dedicated adder unit to perform similar tasks. This paper presents an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2022
ISSN: ['2521-327X']
DOI: https://doi.org/10.22331/q-2022-02-09-647